The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases

To support tempoml operators efficiently, indexing based on tempoml attributes must be supported. In this paper, we pmpose a dynamic and eficient index scheme called the time polygon (TP-index) for tempoml databases. In the scheme, tempoml data are mapped into a two-dimensional tempoml space, where the data can be clustered based on time. The data space is then partitioned into time polygons where each polygon corresponds to a data page. The time polygon directory can be organized as a hiemrchical index. The index handles long dumtion tempoml data elegantly and eficiently. Our performance analysis indicates that the time polygon index is efficient both in storage utilization and query search.